翻訳と辞書 |
Dependent ML : ウィキペディア英語版 | Dependent ML Dependent ML is an experimental functional programming language proposed by Hongwei Xi and Frank Pfenning. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type Nat. Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions. By restricting the generality of full dependent types type checking remains decidable. Type inference remains undecidable. Some computer scientists do not consider DML's types to be dependent as there is still a phase distinction between compilation and execution of the program.〔Aspinall & Hofmann 2005. p. 75.〕 Dependent ML has been superseded by ATS and is no longer under active development. == See also ==
* Indexed type
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Dependent ML」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|